Generalized Oldham Coupling of Turning Block Double Circular-Arc-Slider Mechanism
نویسندگان
چکیده
منابع مشابه
Numerical Simulation and Experimental Examination of an Oldham Coupling
In scroll compressors, Oldham couplings (OCs) have typical been formed of aluminum alloy and have often broken issues due to the high loads which are transmitted from the orbiting scroll. This problem was especially pronounced during flooded start or slug conditions. In this paper, five pcs mass production OCs (standard OC), which are broken during a special slug test are investigated by classi...
متن کاملPerfect Circular Arc Coloring
The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This N P-hard problem arises in a rich variety of applications and has been studied extensively. In this paper we present an O(n2m) combinatorial algorithm for optimally coloring any set of arcs that corresponds to a perfect graph, and propose a new approac...
متن کاملRobust Circular Arc Detection
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of its detection. It is based on Random Sample Consensus minimization, and uses techniques that are inspired from object tracking in image sequences. It is based on simple initial guesses, either based on connected line...
متن کاملBoxicity of Circular Arc Graphs
A k-dimensional box is the cartesian product R1 ×R2 × · · · ×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes: that is two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a ...
متن کاملPathwidth of Circular-Arc Graphs
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time. We give in this paper an O(n)-time algorithm computing the pathwidth of circular-arc graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of JSME
سال: 1972
ISSN: 0021-3764,1881-1426
DOI: 10.1299/jsme1958.15.520